Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
نویسندگان
چکیده
منابع مشابه
Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots so that successive operations can be overlapped in a multi-stage production system. This paper presents a procedure for minimizing the mean weighted absolute deviation from due dates when jobs are scheduled in a lot-streaming #ow shop. This performance criterion has been shown to be non-regular and requires a...
متن کاملThe NP-Hardness of Minimizing the Total Late Work on an Unbounded Batch Machine
We consider the problem of minimizing the total late work ( n ∑ j=1 V j) on an unbounded batch processing machine, where V j = min{Tj, p j} and Tj = max{C j−d j,0}. The batch processing machine can process up to B (B≥ n) jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time, respectively. For a batch of jobs, the proc...
متن کاملMinimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates
The considered problem is the scheduling of a set of N jobs on M identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant ...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملMinimizing the Expected Number of Tardy Jobs in Dynamic Flow Shop with Stochastic Due Dates
The problem of minimizing the expected number of tardy jobs in a dynamic m machine flow shop i.e., Fm�rj�E�∑Uj� is studied in this research. It is assumed that the jobs with deterministic processing times and stochastic due dates arrive dynamically and randomly to the flow shop cell. The due date of each job is assumed to be normally distributed with known mean and variance. A dynamic method is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.03.011